An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption
نویسندگان
چکیده
منابع مشابه
Efficient Identity-Based Encryption over NTRU Lattices
Efficient implementations of lattice-based cryptographic schemes have been limited to only the most basic primitives like encryption and digital signatures. The main reason for this limitation is that at the core of many advanced lattice primitives is a trapdoor sampling algorithm (Gentry, Peikert, Vaikuntanathan, STOC 2008) that produced outputs that were too long for practical applications. I...
متن کاملCCA-Secure Hierarchical Identity Based Encryption Without Random Oracle
We consider the problem of constructing a HIBE protocol which is secure in the full model against chosen ciphertext attacks without using random oracle. Known techniques (generic as well as non-generic) convert an (h + 1)-level CPA-secure HIBE protocol into an h-level CCA-secure HIBE protocol. Applied to known constructions, these result in an h-level CCA-secure HIBE whose security degradation ...
متن کاملILTRU: An NTRU-Like Public Key Cryptosystem Over Ideal Lattices
In this paper we present a new NTRU-Like public key cryptosystem with security provably based on the worst case hardness of the approximate both Shortest Vector Problem (SVP) and Closest Vector Problem (CVP) in some structured lattices, called ideal lattices. We show how to modify the ETRU cryptosystem, an NTRU-Like public key cryptosystem based on the Eisenstein integers 3 [ ] where 3 is a...
متن کاملAn Efficient and Provable Secure Revocable Identity-Based Encryption Scheme
Revocation functionality is necessary and crucial to identity-based cryptosystems. Revocable identity-based encryption (RIBE) has attracted a lot of attention in recent years, many RIBE schemes have been proposed in the literature but shown to be either insecure or inefficient. In this paper, we propose a new scalable RIBE scheme with decryption key exposure resilience by combining Lewko and Wa...
متن کاملFuzzy Identity Based Encryption from Lattices
Cryptosystems based on the hardness of lattice problems have recently acquired much importance due to their average-case to worst-case equivalence, their conjectured resistance to quantum cryptanalysis, their ease of implementation and increasing practicality, and, lately, their promising potential as a platform for constructing advanced functionalities. In this work, we construct “Fuzzy” Ident...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2013
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2012.02.030